The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography
نویسندگان
چکیده
The code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over Fq due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Girault and discuss on a connection between code equivalence and the hidden subgroup problem.
منابع مشابه
Limitations of single coset states and quantum algorithms for code equivalence
Quantum computers can break the RSA, El Gamal, and elliptic curve public-key cryptosystems, as they can efficiently factor integers and extract discrete logarithms. The power of such quantum attacks lies in quantum Fourier sampling, an algorithmic paradigm based on generating and measuring coset states. In this article we extend previous negative results of quantum Fourier sampling for Graph Is...
متن کاملOn lower bounds for Information Set Decoding over Fq
Code-based cryptosystems are promising candidates for post-quantum cryptography. The increasing number of cryptographic schemes that are based on codes over fields different from F2 requires an analysis of their security. Information Set Decoding (ISD) is one of the most important generic attacks against code-based cryptosystems. We give lower bounds for ISD over Fq, thereby anticipating future...
متن کاملA Class of Nonbinary Codes and Their Weight Distribution
Nonlinear functions have important applications in coding theory and cryptography [16, 7]. Linear codes constructed from functions with high nonlinearity [17, 11, 2, 6] can be good and have useful applications in communications [9, 19, 10, 18] or cryptography [5, 4, 3, 21]. For a code, its weight distribution is important to study its structure and to provide information on the probability of u...
متن کاملAn Improved Threshold Ring Signature Scheme Based on Error Correcting Codes
The concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in [1]. Their proposal uses Stern’s identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reductio...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کامل